Evolving networks with distance preferences.

نویسندگان

  • J Jost
  • M P Joy
چکیده

We study evolving networks where new nodes when attached to the network form links with other nodes of preferred distances. A particular case is where always the shortest distances are selected ("make friends with the friends of your present friends"). We present simulation results for network parameters like the first eigenvalue of the graph Laplacian (synchronizability), clustering coefficients, average distances, and degree distributions for different distance preferences and compare them with the parameter values for random and scale-free networks. We find that for the shortest distance rule we obtain a power-law degree distribution as in scale-free networks, while the other parameters are significantly different, especially the clustering coefficient.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A social recommender system based on matrix factorization considering dynamics of user preferences

With the expansion of social networks, the use of recommender systems in these networks has attracted considerable attention. Recommender systems have become an important tool for alleviating the information that overload problem of users by providing personalized recommendations to a user who might like based on past preferences or observed behavior about one or various items. In these systems...

متن کامل

A Review of Spatial Factor Modeling Techniques in Recommending Point of Interest Using Location-based Social Network Information

The rapid growth of mobile phone technology and its combination with various technologies like GPS has added location context to social networks and has led to the formation of location-based social networks. In social networking sites, recommender systems are used to recommend points of interest (POIs) to users. Traditional recommender systems, such as film and book recommendations, have a lon...

متن کامل

Vertex-centred Method to Detect Communities in Evolving Networks

Finding communities in evolving networks is a difficult task and raises issues different from the classic static detection case. We introduce an approach based on the recent vertex-centred paradigm. The proposed algorithm, named DynLOCNeSs, detects communities by scanning and evaluating each vertex neighbourhood by means of a preference measure, using these preferences to handle community chang...

متن کامل

The effect of increasing distance of external focus and preference on performance accuracy in dart throwing

The present study examined the effectiveness of distal versus proximal external foci of attentions a function of performers’ preferences for a certain focus. dart throwing task were used, and participants (N=20) were instructed to direct their attention either to the target (distal focus) or the flight of the dart (proximal focus). Participants were asked to select their preferred focus aft...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 66 3 Pt 2A  شماره 

صفحات  -

تاریخ انتشار 2002